Proof Theory for Full Intuitionistic Linear Logic , Bilinear Logic , and Mix Categories

نویسنده

  • Michael Barr
چکیده

This note applies techniques we have developed to study coherence in monoidal categories with two tensors, corresponding to the tensor–par fragment of linear logic, to several new situations, including Hyland and de Paiva’s Full Intuitionistic Linear Logic (FILL), and Lambek’s Bilinear Logic (BILL). Note that the latter is a noncommutative logic; we also consider the noncommutative version of FILL. The essential difference between FILL and BILL lies in requiring that a certain tensorial strength be an isomorphism. In any FILL category, it is possible to isolate a full subcategory of objects (the “nucleus”) for which this transformation is an isomorphism. In addition, we define and study the appropriate categorical structure underlying the MIX rule. For all these structures, we do not restrict consideration to the “pure” logic as we allow non-logical axioms. We define the appropriate notion of proof nets for these logics, and use them to describe coherence results for the corresponding categorical structures. 0. Introduction In [CS91] we introduced the notion of “weakly distributive category”, now renamed “linearly distributive category”, in order to study the pure proof theory of the cut rule for the sequent calculus with finite sequences of formulas on both sides of the turnstile. This is generally thought of as the “classical” sequent calculus, but in fact this proof theory is not truly “classical” in any real sense, and may be thought of as the tensor–par fragment of linear logic with no negation. We wished to show how features could be added in a modular fashion to this basic categorical setting, in order to model the more expressive fragments of linear logic: this program is now largely complete, see [CS91, BCST, BCS92], and includes the subject matter of this paper. Crucial to this program was the provision of an intrinsic characterization of the par. In classical linear logic the negation was an obstruction, for it allowed the par to be viewed as merely the de Morgan dual of the usual tensor product, and so for its special Research partially supported by NSERC, Canada. Research partially supported by Le Fonds FCAR, Québec, and NSERC, Canada. Diagrams in this paper were produced with the help of the TEXcad drawing program of G. Horn and the diagram macros of F. Borceux. Received by the editors 1996 September 23 and, in revised form, 1997 March 17. Published on 1997 March 28 1991 Mathematics Subject Classification : 03B70, 03F07, 03G30, 18D10, 18D15, 19D23.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Full Intuitionistic Linear Logic (extended abstract)

Hyland, M. and V. de Paiva, Full intuitionistic linear logic (extended abstract), Annals of Pure and Applied Logic 64 (1993) 273-291. In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicati...

متن کامل

Profunctor Semantics for Linear Logic

Linear logic is a sort of “resource-aware” logic underlying intuitionistic logic. Investigations into the proof theory of this logic typically revolve around proof nets, certain two-dimensional graphical representations of proofs. Where sequent calculus deductions enforce arbitrary distinctions between proofs and complicate these investigations, proof nets represent sequent calculus deductions ...

متن کامل

Categorical Proof Theory of Co-Intuitionistic Linear Logic

To provide a categorical semantics for co-intuitionistic logic, one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of co-products does not work in the category Set, where co-products are disjoint unions. Following the familiar construction of models of intuitionistic linear logic with exponent !, we build models of co-intuitionistic logic in symm...

متن کامل

Towards Efficient Subsumption

We propose several methods for writing efficient subsumption procedures for non-unit clauses, tested in practice as parts incorporated into the Gandalf family of theorem provers. Versions of Gandalf exist for classical logic, first order intuitionistic logic and type theory. Subsumption is one of the most important techniques for cutting down search space in resolution theorem proving. However,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997